package com.tang.algorithm.array;

/**
 * @author tlm
 * @version 1.0
 * @date 2020/5/27 6:14 下午
 * 统计位数为偶数的数字
 */
public class LeetCode1295 {
    public static void main(String[] args) {
        int[] a ={12,123,1234,22,13,2};
    }
    public static int findNumbers(int[] nums) {
        int sum=0;
        for (int i = 0; i <nums.length ; i++) {
            sum=String.valueOf(nums[i]).length()%2==0?sum+1:sum;
        }
        return sum;
    }
}
